Efficient multi-agent task allocation for collaborative route planning with multiple unmanned vehicles
نویسندگان
چکیده
منابع مشابه
Constrained Dynamic Route Planning for Unmanned Ground Vehicles
Unmanned Ground Vehicles are tasked with negotiating off-road terrain while satisfying certain objectives, such as maintaining cover and concealment and arriving at a phase line by a designated time. The problem is complicated by the fact that the terrain is typically not known completely in advance, rendering pre-planned routes useless if selected passageways are obstructed. In this situation,...
متن کاملA Novel Communication-Less Approach to Task Allocation for Multiple Unmanned Aerial Vehicles
In this paper, we present a scalable, decentralized task allocation algorithm for a group of unknown number of Unmanned Aerial Vehicles (UAVs), which are equipped with GPS receivers, synchronized clocks and omni-directional sensors with a finite, but known field-of-view to identify neighbors. The algorithm assigns subgroups of UAVs, whose initial positions are randomly scattered in a bounded sp...
متن کاملA Multi-Agent Operator Interface for Unmanned Aerial Vehicles
Future unmanned aerial vehicles (UAVs) are designed to fly at long range and high endurance, and to perform complex and demanding tasks such as surveillance and reconnaissance, electronic warfare, command and control, target acquisition, and weapon guidance. The current preprogrammed ground control strategy will not be able to meet the task complexity, long range and high endurance requirements...
متن کاملMulti-Agent Task Allocation for Robot Soccer
This paper models and analyzes task allocation methodologies for multiagent systems. The evaluation process was implemented as a collection of simulated soccer matches. A soccer-simulation software package was used as the test-bed as it provided the necessary features for implementing and testing the methodologies. The methodologies were tested through competitions with a number of available so...
متن کاملCombining Planning with Reinforcement Learning for Multi-robot Task Allocation
We describe an approach to the multi-robot task allocation (MRTA) problem in which a group of robots must perform tasks that arise continuously, at arbitrary locations across a large space. A dynamic scheduling algorithm is derived in which proposed plans are evaluated using a combination of short-term lookahead and a value function acquired by reinforcement learning. We demonstrate that this d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.686